Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar4/CimeSLASHintersect.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

APP₂(app₂(l1, l2), l3) -> APP₂(l2, l3)
MEM₂(x, cons₂(y, l)) -> EQ₂(x, y)
IFINTER₄(true, x, l1, l2) -> INTER₂(l1, l2)
INTER₂(app₂(l1, l2), l3) -> INTER₂(l2, l3)
INTER₂(app₂(l1, l2), l3) -> INTER₂(l1, l3)
INTER₂(l1, cons₂(x, l2)) -> MEM₂(x, l1)
MEM₂(x, cons₂(y, l)) -> IFMEM₃(eq₂(x, y), x, l)
INTER₂(l1, app₂(l2, l3)) -> APP₂(inter₂(l1, l2), inter₂(l1, l3))
IFMEM₃(false, x, l) -> MEM₂(x, l)
INTER₂(l1, cons₂(x, l2)) -> IFINTER₄(mem₂(x, l1), x, l2, l1)
EQ₂(s₁(x), s₁(y)) -> EQ₂(x, y)
INTER₂(l1, app₂(l2, l3)) -> INTER₂(l1, l3)
INTER₂(cons₂(x, l1), l2) -> IFINTER₄(mem₂(x, l2), x, l1, l2)
INTER₂(l1, app₂(l2, l3)) -> INTER₂(l1, l2)
INTER₂(app₂(l1, l2), l3) -> APP₂(inter₂(l1, l3), inter₂(l2, l3))
INTER₂(cons₂(x, l1), l2) -> MEM₂(x, l2)
APP₂(app₂(l1, l2), l3) -> APP₂(l1, app₂(l2, l3))
IFINTER₄(false, x, l1, l2) -> INTER₂(l1, l2)
APP₂(cons₂(x, l1), l2) -> APP₂(l1, l2)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP₂(app₂(l1, l2), l3) -> APP₂(l2, l3)
MEM₂(x, cons₂(y, l)) -> EQ₂(x, y)
IFINTER₄(true, x, l1, l2) -> INTER₂(l1, l2)
INTER₂(app₂(l1, l2), l3) -> INTER₂(l2, l3)
INTER₂(app₂(l1, l2), l3) -> INTER₂(l1, l3)
INTER₂(l1, cons₂(x, l2)) -> MEM₂(x, l1)
MEM₂(x, cons₂(y, l)) -> IFMEM₃(eq₂(x, y), x, l)
INTER₂(l1, app₂(l2, l3)) -> APP₂(inter₂(l1, l2), inter₂(l1, l3))
IFMEM₃(false, x, l) -> MEM₂(x, l)
INTER₂(l1, cons₂(x, l2)) -> IFINTER₄(mem₂(x, l1), x, l2, l1)
EQ₂(s₁(x), s₁(y)) -> EQ₂(x, y)
INTER₂(l1, app₂(l2, l3)) -> INTER₂(l1, l3)
INTER₂(cons₂(x, l1), l2) -> IFINTER₄(mem₂(x, l2), x, l1, l2)
INTER₂(l1, app₂(l2, l3)) -> INTER₂(l1, l2)
INTER₂(app₂(l1, l2), l3) -> APP₂(inter₂(l1, l3), inter₂(l2, l3))
INTER₂(cons₂(x, l1), l2) -> MEM₂(x, l2)
APP₂(app₂(l1, l2), l3) -> APP₂(l1, app₂(l2, l3))
IFINTER₄(false, x, l1, l2) -> INTER₂(l1, l2)
APP₂(cons₂(x, l1), l2) -> APP₂(l1, l2)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 4 SCCs with 5 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPAfsSolverProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP₂(app₂(l1, l2), l3) -> APP₂(l2, l3)
APP₂(app₂(l1, l2), l3) -> APP₂(l1, app₂(l2, l3))
APP₂(cons₂(x, l1), l2) -> APP₂(l1, l2)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

APP₂(app₂(l1, l2), l3) -> APP₂(l2, l3)
APP₂(app₂(l1, l2), l3) -> APP₂(l1, app₂(l2, l3))

Used argument filtering: APP₂(x1, x2) = x1
app₂(x1, x2) = app₂(x1, x2)
cons₂(x1, x2) = x2
Used ordering: Quasi Precedence: trivial

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPAfsSolverProof

              ↳ QDP

                ↳ QDPAfsSolverProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP₂(cons₂(x, l1), l2) -> APP₂(l1, l2)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

APP₂(cons₂(x, l1), l2) -> APP₂(l1, l2)

Used argument filtering: APP₂(x1, x2) = x1
cons₂(x1, x2) = cons₁(x2)
Used ordering: Quasi Precedence: trivial

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPAfsSolverProof

              ↳ QDP

                ↳ QDPAfsSolverProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPAfsSolverProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

EQ₂(s₁(x), s₁(y)) -> EQ₂(x, y)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

EQ₂(s₁(x), s₁(y)) -> EQ₂(x, y)

Used argument filtering: EQ₂(x1, x2) = x2
s₁(x1) = s₁(x1)
Used ordering: Quasi Precedence: trivial

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPAfsSolverProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPAfsSolverProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MEM₂(x, cons₂(y, l)) -> IFMEM₃(eq₂(x, y), x, l)
IFMEM₃(false, x, l) -> MEM₂(x, l)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

MEM₂(x, cons₂(y, l)) -> IFMEM₃(eq₂(x, y), x, l)

Used argument filtering: MEM₂(x1, x2) = x2
cons₂(x1, x2) = cons₁(x2)
IFMEM₃(x1, x2, x3) = x3
Used ordering: Quasi Precedence: trivial

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPAfsSolverProof

              ↳ QDP

                ↳ DependencyGraphProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IFMEM₃(false, x, l) -> MEM₂(x, l)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 0 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

INTER₂(l1, cons₂(x, l2)) -> IFINTER₄(mem₂(x, l1), x, l2, l1)
INTER₂(l1, app₂(l2, l3)) -> INTER₂(l1, l3)
INTER₂(cons₂(x, l1), l2) -> IFINTER₄(mem₂(x, l2), x, l1, l2)
INTER₂(l1, app₂(l2, l3)) -> INTER₂(l1, l2)
IFINTER₄(true, x, l1, l2) -> INTER₂(l1, l2)
INTER₂(app₂(l1, l2), l3) -> INTER₂(l2, l3)
INTER₂(app₂(l1, l2), l3) -> INTER₂(l1, l3)
IFINTER₄(false, x, l1, l2) -> INTER₂(l1, l2)

The TRS R consists of the following rules:

if₃(true, x, y) -> x
if₃(false, x, y) -> y
eq₂(0, 0) -> true
eq₂(0, s₁(x)) -> false
eq₂(s₁(x), 0) -> false
eq₂(s₁(x), s₁(y)) -> eq₂(x, y)
app₂(nil, l) -> l
app₂(cons₂(x, l1), l2) -> cons₂(x, app₂(l1, l2))
app₂(app₂(l1, l2), l3) -> app₂(l1, app₂(l2, l3))
mem₂(x, nil) -> false
mem₂(x, cons₂(y, l)) -> ifmem₃(eq₂(x, y), x, l)
ifmem₃(true, x, l) -> true
ifmem₃(false, x, l) -> mem₂(x, l)
inter₂(x, nil) -> nil
inter₂(nil, x) -> nil
inter₂(app₂(l1, l2), l3) -> app₂(inter₂(l1, l3), inter₂(l2, l3))
inter₂(l1, app₂(l2, l3)) -> app₂(inter₂(l1, l2), inter₂(l1, l3))
inter₂(cons₂(x, l1), l2) -> ifinter₄(mem₂(x, l2), x, l1, l2)
inter₂(l1, cons₂(x, l2)) -> ifinter₄(mem₂(x, l1), x, l2, l1)
ifinter₄(true, x, l1, l2) -> cons₂(x, inter₂(l1, l2))
ifinter₄(false, x, l1, l2) -> inter₂(l1, l2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.